Automated Parameter Tuning for Steering Algorithms

نویسندگان

  • G. Berseth
  • M. Kapadia
  • P. Faloutsos
چکیده

We propose a statistical framework and a methodology for automatically characterizing the influence that a steering algorithm’s parameters have on its performance. Our approach uses three performance criteria: the success rate of an algorithm in solving representative scenarios, the quality of the simulations solution, and the algorithm’s computational efficiency. Given an objective defined as a weighted combination of the performance criteria, we formulate an optimization problem in the space of the algorithm’s parameters that we solve with an evolutionarybased approach. Although our framework can analyze an algorithm from many perspectives, we present two demonstrative studies: a univariate analysis that studies the effects of each of the algorithm’s parameters in isolation, and a multivariate analysis that studies the combined effect of the algorithm’s parameters on the objectives.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient and Robust Parameter Tuning for Heuristic Algorithms

The main advantage of heuristic or metaheuristic algorithms compared to exact optimization methods is their ability in handling large-scale instances within a reasonable time, albeit at the expense of losing a guarantee for achieving the optimal solution. Therefore, metaheuristic techniques are appropriate choices for solving NP-hard problems to near optimality. Since the parameters of heuristi...

متن کامل

Automated Parameter Tuning Framework for Heterogeneous and Large Instances: Case Study in Quadratic Assignment Problem

This paper is concerned with automated tuning of parameters of algorithms to handle heterogeneous and large instances. We propose an automated parameter tuning framework with the capability to provide instance-specific parameter configurations. We report preliminary results on the Quadratic Assignment Problem (QAP) and show that our framework provides a significant improvement on solutions qual...

متن کامل

Recent Development in Automatic Parameter Tuning for Metaheuristics

Parameter tuning is an optimization problem with the objective of finding good static parameter settings before the execution of a metaheuristic on a problem at hand. The requirement of tuning multiple control parameters, combined with the stochastic nature of the algorithms, make parameter tuning a non-trivial problem. To make things worse, one parameter vector allowing the algorithm to solve ...

متن کامل

Fine-Tuning Algorithm Parameters Using the Design of Experiments Approach

Optimizing parameter settings is an important task in algorithm design. Several automated parameter tuning procedures/configurators have been proposed in the literature, most of which work effectively when given a good initial range for the parameter values. In the Design of Experiments (DOE), a good initial range is known to lead to an optimum parameter setting. In this paper, we present a fra...

متن کامل

Using Cost Distributions to Guide Weight Decay in Local Search for SAT

Although clause weighting local search algorithms have produced some of the best results on a range of challenging satisfiability (SAT) benchmarks, this performance is dependent on the careful handtuning of sensitive parameters. When such hand-tuning is not possible, clause weighting algorithms are generally outperformed by self-tuning WalkSAT-based algorithms such as AdaptNovelty and AdaptGWSA...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013